搜索资源列表
Node
- 非常实用的系统架构模式，以树结构构建系统架构，即插即用的模式，能够实现复杂对象系统，来自于项目的实例，极具参考价值。包括对父子节点的操作。-Very practical system architecture model, a tree structure to build the system architecture, plug and play mode, complex objects, in the instance of the project, great reference va
PATTree
- 数据结构中PAT树的实现，包括树节点的插入、删除、查找和遍历。PAT tree 在字符串子串匹配上有这非常优异的表现，这使得它经常成为一种高效的全文检索算法，在自然语言处理领域也有广泛的应用。-PAT tree data structure, including the insertion of the tree node, delete, search, and traversal. PAT tree in the string substring match this excellent p
tree
- 二叉树的基本运算，遍历，从根节点到子节点的路径和中序线索化。还有用遍历构造二叉树和用二叉树来表示代数表达式。-The basic operations of binary tree traversal path from the root node to child node in the sequence threaded. There traverse the constructed binary tree and binary tree to represent algebraic exp
output-a-tree
- 树的水平输出算法实现：对于给定二叉树，以水平方向输出二叉树。每个节点包含一个整数值，并且节点数最大255。节点数据的输出方向为从左到右，从上到下，同一水平高度的节点输出完成后，再输出下一水平高度。 -The tree level output algorithm: output in the horizontal direction for a given binary tree, binary tree. Each node contains an integer value, and t
Binary-tree
- 该文件主要为二叉树实验指导报告和代码，内容主要是二叉树的链式存储结构，二叉树的相关性质，二叉树的链式存储结构，二叉树结点的递归访问方法-The file binary tree experiments guidance report and code, the main chain storage structure of the binary tree, binary tree nature of the chain storage structure of the binary tree,
TREE_LIST
- 一个treelist控件，可以递归5层子树节点，视图里边创建。-A treelist control, recursive five-layer sub-tree node, create a view inside.
Tree
- 对树的各种操作，包括二叉排序树，其中通过先序遍历和中序遍历构造二叉树，以及深度遍历，广度遍历，层度遍历，以及删除二叉排序树的某一个节点的操作。对学习数据结构有很大的帮助。-Various operations on the tree, including the binary sort tree, the first traversal and traversal construct a binary tree, as well as the depth of the traversal, br
NewTreeList
- 设计一个树视图类，树视可以有多列Item，且选中一个树节点时，可以修改该项的值。-Design a tree view of the class tree, as multiple columns Item, select a tree node, you can modify the value of the item.
vector-tree
- wpf tree控件读取磁盘信息，为节点获取系统图片-wpf tree control to read the disk information for node acquisition system picture
ccxTreeLiistx
- cxTreeList使用Demo，包包括树结点增、删、改，插入拷贝粘贴等功能 -cxTreeList using the Demo, the package includes tree node increase, delete, change, insert, copy and paste functions
optimal-binary-tree
- 这个程序通过dp来构建最优的二叉树，使得效率更好，将高概率的结点放在高处。通过o（n^2)实现。-To build this program by dp optimal binary tree, making better efficiency, the high probability of the node on the height. O (n ^ 2).
TreeWiewDemo
- 该源码为JAVA编写的树形控件。通过JAVA对象关系设置树形结点。JSP负责显示-The source for JAVA written TreeControl. JAVA object-relational set tree node. JSP is responsible for displaying
active-learning-code
- Learning_random.m : 随机选择样例，从（90）pool里随机选择样本，删除版本空间树的数量 activeLearning.m:根据最大熵原则,从pool里选择样本，删除版本空间树的数量 getlabel.m:根据树和测试样例，得到根据该树得到的类标 getTrees.m:从提供的大量树结构(随机生成的)中，随机挑选一定数量的树(如果该树的叶子节点无类标随机添加) RandomCreateTree_d_unbalance:根据样本点割点中的非平衡割点建造树，
Tree-10-13
- 用C语言创建树结构,对生产的树进行遍历，或按要求查询指定的叶子节点-Tree structure created with the C language, the production tree traversal, or required to query the specified leaf node
2-3-tree
- n computer science, a 2-3 tree is a type of data structure, a tree where every node with children (internal node) has either two children (2-node) and one data element or three children (3-nodes) and two data elements. Nodes on the outside of the tre
tree-data
- In computer science, a tree is a widely used data structure that simulates a hierarchical tree structure with a set of linked nodes. A tree can be defined recursively (locally) as a collection of nodes (starting at a root node), where each node
hh
- 文本为一个用c语言编写用于产生一个二叉树的源码文本。以三元组形式输入任意二叉树（以大写字母表示结点），求以任意一选定结点为子树的深度。-Text for a c language is used to generate a binary tree of the source text. Enter any form of triples binary tree node (in capital letters), and demand in any one selected node subtr
tree
- 创建二叉树并以根结点为参数交换每个结点的左右子树，查找x结点并输出其所有的祖先结点，以中序遍历和前序遍历创建二叉树。-Create a binary tree and parameter exchange for each node of the root node to the left and right subtree, find x nodes and output nodes of all its ancestors, create a binary tree in order tra
erchashu
- 设计程序实现二叉树结点的类型定义和对二叉树的基本操作。该程序包括二叉树结构类型以及每一种操作的具体的函数定义和主函数-Design procedures to achieve binary tree node type definitions and basic operation of the binary tree. The program includes a binary tree structure type, as well as each operation of the spec
trees-DLR-and-LDR
- 设二叉树结点值为大写字母，输入二叉树的前序遍历和中序遍历序列，生成此二叉树，输出该二叉树的后序遍历和按层次遍历序列。输入某结点值，在二叉树中查找该结点，若该结点存在，则输出从根到该结点的路径，否则给出不存在信息。 -Let binary tree node value of capital letters input binary tree preorder traversal and inorder traversal sequences, this binary tree is gene